Relation between Randić Index and Average Distance of Trees

نویسندگان

  • Marek Cygan
  • Michał Pilipczuk
  • Riste Škrekovski
چکیده

The Randić index R(G) of a graph G is the sum of weights (deg(u) deg(v))−0.5 over all edges uv of G, where deg(v) denotes the degree of a vertex v. We prove that for any tree T with n1 leaves R(T ) ≥ ad(T ) + max(0,n1 − 2), where ad(T ) is the average distance between vertices of T . As a consequence we resolve the conjecture R(G) ≥ ad(G) given by Fajtlowicz in 1988 for the case when G is a tree.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On relation between the Kirchhoff index and number of spanning trees of graph

Let $G=(V,E)$, $V={1,2,ldots,n}$, $E={e_1,e_2,ldots,e_m}$,be a simple connected graph, with sequence of vertex degrees$Delta =d_1geq d_2geqcdotsgeq d_n=delta >0$ and Laplacian eigenvalues$mu_1geq mu_2geqcdotsgeqmu_{n-1}>mu_n=0$. Denote by $Kf(G)=nsum_{i=1}^{n-1}frac{1}{mu_i}$ and $t=t(G)=frac 1n prod_{i=1}^{n-1} mu_i$ the Kirchhoff index and number of spanning tree...

متن کامل

On the Modified Randić Index of Trees, Unicyclic Graphs and Bicyclic Graphs

The modified Randić index of a graph G is a graph invariant closely related to the classical Randić index, defined as

متن کامل

On a Relation Between Randić Index and Algebraic Connectivity

A conjecture of AutoGraphiX on the relation between the Randić index R and the algebraic connectivity a of a connected graph G is: R a ≤ ( n− 3 + 2√2 2 ) / ( 2(1− cos π n ) ) with equality if and only if G is Pn, which was proposed by Aouchiche et al. [M. Aouchiche, P. Hansen and M. Zheng, Variable neighborhood search for extremal graphs 19: further conjectures and results about the Randić inde...

متن کامل

Peripheral Wiener Index of a Graph

The eccentricity of a vertex $v$ is the maximum distance between $v$ and anyother vertex. A vertex with maximum eccentricity is called a peripheral vertex.The peripheral Wiener index $ PW(G)$ of a graph $G$ is defined as the sum ofthe distances between all pairs of peripheral vertices of $G.$ In this paper, weinitiate the study of the peripheral Wiener index and we investigate its basicproperti...

متن کامل

Investigating the Structure of Beech Stands in the Gap Making Phase (Case study: Asalem Forests, Guilan)

Forest structure consider the spatial arrangement of trees characteristics such as age, size, species, gender and so on is.This study aimed to investigate the structural diversity of three one-hectare stands in the gap making phase, were studied. For this purpose, three sample plots with a one hectare area were selected in Asalem beech stands which belonged to the structural features of the gap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011